further results on wiener polarity index of graphs
Authors
abstract
the wiener polarity index wp(g) of a molecular graph g of order n is the number ofunordered pairs of vertices u, v of g such that the distance d(u,v) between u and v is 3. in anearlier paper, some extremal properties of this graph invariant in the class of catacondensedhexagonal systems and fullerene graphs were investigated. in this paper, some new bounds forthis graph invariant are presented. a relationship between wiener and wiener polarity indexof some classes of graphs are also presented.
similar resources
Wiener Polarity Index of Tensor Product of Graphs
Mathematical chemistry is a branch of theoretical chemistry for discussion and prediction of the molecular structure using mathematical methods without necessarily referring to quantum mechanics. In theoretical chemistry, distance-based molecular structure descriptors are used for modeling physical, pharmacologic, biological and other properties of chemical compounds. The Wiener Polarity index ...
full textFurther Results on Betweenness Centrality of Graphs
Betweenness centrality is a distance-based invariant of graphs. In this paper, we use lexicographic product to compute betweenness centrality of some important classes of graphs. Finally, we pose some open problems related to this topic.
full textwiener polarity index of tensor product of graphs
mathematical chemistry is a branch of theoretical chemistry for discussion and prediction of the molecular structure using mathematical methods without necessarily referring to quantum mechanics. in theoretical chemistry, distance-based molecular structure descriptors are used for modeling physical, pharmacologic, biological and other properties of chemical compounds. the wiener polarity index ...
full textOn the Extremal Wiener Polarity Index of Hückel Graphs
Graphs are used to model chemical compounds and drugs. In the graphs, each vertex represents an atom of molecule and edges between the corresponding vertices are used to represent covalent bounds between atoms. The Wiener polarity index W p (G) of a graph G is the number of unordered pairs of vertices u, v of G such that the distance between u and v is equal to 3. The trees and unicyclic graphs...
full textOn the Wiener Polarity Index∗
The Wiener polarity indexWP (G) of a graph G is the number of unordered pairs of vertices {u, v} of G such that the distance of u and v is equal to 3. In this paper, we obtain the relation between Wiener polarity index and Zegreb indices, and the relation between Wiener polarity index and Wiener index (resp. hyper-Wiener index). Moreover, we determine the second smallest Wiener polarity index t...
full textFurther results on total mean cordial labeling of graphs
A graph G = (V,E) with p vertices and q edges is said to be a total mean cordial graph if there exists a function f : V (G) → {0, 1, 2} such that f(xy) = [(f(x)+f(y))/2] where x, y ∈ V (G), xy ∈ E(G), and the total number of 0, 1 and 2 are balanced. That is |evf (i) − evf (j)| ≤ 1, i, j ∈ {0, 1, 2} where evf (x) denotes the total number of vertices and edges labeled with x (x = 0, 1, 2). In thi...
full textMy Resources
Save resource for easier access later
Journal title:
iranian journal of mathematical chemistryPublisher: university of kashan
ISSN 2228-6489
volume 2
issue Issue 1 (Special Issue on the Occasion of Mircea V. Diudea's Sixtieth Birthday) 2011
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023